package com.my.algorithmlearning.leetcode;

/**
 * @ClassName Medium_198_RobbingMaxium
 * @Description 题解https://leetcode.cn/problems/house-robber/solution/zhong-deng-198-da-jia-jie-she-dong-tai-g-h6ka/
 * @Author wanghaiwei
 * @Date 2023/6/13 16:03
 */
public class Medium_198_RobbingMaximum {
    public static void main(String[] args) {
        Medium_198_RobbingMaximum robbingMaximum = new Medium_198_RobbingMaximum();
        int[] input = new int[]{1, 2, 3, 1};
        System.out.println(robbingMaximum.rob(input));
    }

    public int rob(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        if (nums.length == 1) {
            return nums[0];
        }
        if (nums.length == 2) {
            return Math.max(nums[0], nums[1]);
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max((dp[i - 2] + nums[i]), dp[i - 1]);
        }
        return dp[nums.length - 1];
    }
}
